import com.sun.xml.internal.ws.api.model.CheckedException;

import java.util.List;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 86183
 * Date: 2024-01-07
 * Time: 20:38
 */
public class MyLinkedList implements IList{
    static class ListNode{
        public int val;
        public ListNode prev;
        public ListNode next;

        public ListNode(int val) {
            this.val = val;
        }
    }
    ListNode head;
    ListNode last;
    @Override
    public void addFirst(int data) {
        ListNode node =new ListNode(data);
        if(head==null){
            head=node ;
            last=node ;

        }else{
            node.next = head;
            head.prev=node;
            head=node;

        }

    }

    @Override
    public void addLast(int data) {
        ListNode node =new ListNode(data);
        if(head==null){
            head=node ;
            last=node ;

        }else{
           last.next=node;
           node.prev=last;
          last=node;
        }
    }

    @Override
    public void addIndex(int index, int data) {
        if(index<0||index>size()){
            System.out.println("index错误"+index);
            return;
        }
        if(index==0){
            addFirst(data);
            return;
        }
        if(index==size()){
            addLast(data);
            return;
        }

        ListNode node = new ListNode(data);
        ListNode cur=findIndex(index);
        node.next=cur;
        cur.prev.next=node;
        node.prev=cur.prev;
        cur.prev=node;
    }
    private ListNode findIndex(int index){
        ListNode cur =head;
        while(index!=0){
            cur=cur.next;
            index--;
        }
        return cur;
    }

    @Override
    public boolean contains(int key) {
        ListNode cur=head;
        while(cur!=null){
            if(cur.val==key){
                return true;
            }
            cur=cur.next;
        }
        return false;
    }

    @Override
    public void remove(int key) {
        ListNode cur=head;
        while(cur!=null){
            if(cur.val==key){
                if(cur==head){
                    head=head.next;
                head.prev=null;
                } else if (cur==last) {
                    last=last.prev;
                    last.next=null;
                    //cur.prev.next=cur.next;
                }else{
                    cur.prev.next=cur.next;
                    cur.next.prev=cur.prev;

                }
                return;
            }else{
                cur = cur.next ;
            }
        }

    }

    @Override
    public void removeAllKey(int key) {
        ListNode cur=head;
        while(cur!=null) {
            if (cur.val == key) {
                if (cur == head) {
                    head = head.next;
                    if (head != null) {
                        head.prev = null;
                    } else {
                        last = null;
                    }

                } else if (cur == last) {
                    last = last.prev;
                    last.next = null;
                    //cur.prev.next=cur.next;
                } else {
                    cur.prev.next = cur.next;
                    cur.next.prev = cur.prev;

                }

            }
            cur = cur.next;


        }
    }

    @Override
    public int size() {
        ListNode cur=head;
        int count=0;
        while(cur!=null){
           count++;
            cur=cur.next;
        }
    return count;

    }

    @Override
    public void display() {
        ListNode cur=head;
        while(cur!=null){
            System.out.print(cur.val+" ");
            cur=cur.next;
        }
        System.out.println();

    }

    @Override
    public void clear() {
        ListNode cur=head;
        while(cur!=null){
            ListNode curNext=cur.next;
            cur.prev=null;
            cur.next=null;
            cur=curNext;
        }
        head=null;
        last=null;

    }
}
